I. C. Wong, Z. Shen, J. G. Andrews, and B. L. Evans, ``A Low Complexity Algorithm for Proportional Resource Allocation in OFDMA Systems , Proc. IEEE Int. Work. Signal Processing Systems, 針對(duì)這篇文章給出的源代碼
上傳時(shí)間： 2014-01-24
上傳用戶：zhichenglu
A Simple isochronous transfer. Reads 8051 ports A,B and C, and continuously sends a five byte packet over EP8IN:
標(biāo)簽： continuously isochronous and transfer
上傳時(shí)間： 2015-02-01
上傳用戶：ywqaxiwang
R樹(shù)與B樹(shù)的混合樹(shù)，在這個(gè)程序里面可以直接用R樹(shù)和B樹(shù)
標(biāo)簽： 樹(shù)
上傳時(shí)間： 2013-12-19
上傳用戶：ouyangtongze
If we have two individually sorted vectors "a" and "b" but they are not sorted with respect to each other and we want to merge them into vector "c" such that "c" is also a sorted vector. Then c=mergesorted(a,b) can be used.
標(biāo)簽： sorted individually respect vectors
上傳時(shí)間： 2015-09-23
上傳用戶：comua
Distributed Median,Alice has an array A, and Bob has an array B. All elements in A and B are distinct. Alice and Bob are interested in finding the median element of their combined arrays.
標(biāo)簽： array B. Distributed has
上傳時(shí)間： 2013-12-25
上傳用戶：洛木卓
bool 運(yùn)算(a)and(b)二進(jìn)制十進(jìn)制顯示
標(biāo)簽： bool and 運(yùn)算 二進(jìn)制
上傳時(shí)間： 2013-11-28
上傳用戶：waitingfy
杭電 ACM 1002 I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.
標(biāo)簽： integers problem calcul simple
上傳時(shí)間： 2014-01-12
上傳用戶：dave520l
a XOR b> a,然后a XOR b< b,and both a and b are dependent data
標(biāo)簽： XOR and dependent both
上傳時(shí)間： 2014-01-27
上傳用戶：yxgi5
該程序用以查找任意兩個(gè)整數(shù)之間的所有素?cái)?shù)。 Prime number finder can find all primes between a and b and will write the results to the file PRIMES.TXT
標(biāo)簽： and between number finder
上傳時(shí)間： 2014-01-14
上傳用戶：cccole0605
To use this function just define a variable say var, var = pnseq(a, b, c) for a, b and c refer to the zip file
標(biāo)簽： var function variable define
上傳時(shí)間： 2014-01-06
上傳用戶：zhuoying119
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
